Small Prime Powers in the Fibonacci Sequence
نویسنده
چکیده
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenthor seventeenth powers in the Fibonacci sequence. For eleventh, thirteenthand seventeenth powers an alternative (to the usual exhaustive check of products of powers of fundamental units) method is used to overcome the problem of having a large number of independent units and relatively high bounds on their exponents. It is envisaged that the same method can be used to decide the question of the existence of higher small prime powers in the Fibonacci sequence and that the method can be applied to other binary recurrence sequences. The alternative method mentioned may have wider applications.
منابع مشابه
Generalized Fibonacci Sequences modulo Powers of a Prime
Let us begin by defining a generalized Fibonacci sequence (gn) with all gn in some abelian group as a sequence that satisfies the recurrence gn = gn−1 + gn−2 as n ranges over Z. The Fibonacci sequence (Fn) is the generalized Fibonacci sequence with integer values defined by F0 = 0 and F1 = 1. Recall also the Binet formula: for any integer n, Fn = (α − β)/ √ 5, where α = (1 + √ 5)/2 and β = (1− ...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملPerfect Powers from Products of Terms in Lucas Sequences
Suppose that {Un}n≥0 is a Lucas sequence, and suppose that l1, . . . , lt are primes. We show that the equation Un1 · · ·Unm = ±l x1 1 · · · l xt t y , p prime, m < p, has only finitely many solutions. Moreover, we explain a practical method of solving these equations. For example, if {Fn}n≥0 is the Fibonacci sequence, then we solve the equation Fn1 · · ·Fnm = 2 x1 · 32 · 53 · · · 541100y under...
متن کاملFibonacci Numbers at Most One Away from a Perfect Power
The famous problem of determining all perfect powers in the Fibonacci sequence and the Lucas sequence has recently been resolved by three of the present authors. We sketch the proof of this result, and we apply it to show that the only Fibonacci numbers Fn such that Fn ± 1 is a perfect power are 0, 1, 2, 3, 5 and 8. The proof of the Fibonacci Perfect Powers Theorem involves very deep mathematic...
متن کاملA Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کامل